منابع مشابه
Random Walks and Bisections in Random Circulant Graphs
Abstract. Using number theoretical tools, we prove two main results for random r-regular circulant graphs with n vertices, when n is sufficiently large and r is fixed. First, for any fixed ε > 0, prime n and L ≥ n(log n), walks of length at most L terminate at every vertex with asymptotically the same probability. Second, for any n, there is a polynomial time algorithm to find a vertex bisector...
متن کاملDiameters and Clique Numbers of Quasi-random Graphs
We show that every quasi-random graph G(n) with n vertices and minimum degree (1 + o(1))n/2 has diameter either 2 or 3 and that every quasi-random graph G(n) with n vertices has a clique number of o(n) with wide spread.
متن کاملDiameters in Supercritical Random Graphs Via First Passage Percolation
We study the diameter of C1, the largest component of the Erdős-Rényi random graph G(n, p) emerging from the critical window, i.e., for p = 1+ε n where εn → ∞ and ε = o(1). This parameter was extensively studied for fixed ε > 0, yet results for ε = o(1) outside the critical window were only obtained very recently: Riordan and Wormald gave precise estimates on the diameter, however these do not ...
متن کاملDiameters of Cayley Graphs
We show that for integers k ≥ 2 and n ≥ 3, the diameter of the Cayley graph of SLn(Z/kZ) associated to a standard two-element generating set, is at most a constant times n 2 ln k. This answers a question of A. Lubotzky concerning SLn(Fp) and is unexpected because these Cayley graphs do not form an expander family. Our proof amounts to a quick algorithm for finding short words representing eleme...
متن کاملGossiping in circulant graphs Gossiping in circulant graphs
ENG) We investigate the gossiping problem, in which nodes of an intercommunication network share information initially given to each one of them according to a communication protocol by rounds. We consider two types of communication protocols: vertex-disjoint path mode, and edge-disjoint path mode. We give a general lower bound on the complexity of gossiping algorithms in terms of the isoperime...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 2013
ISSN: 0209-9683,1439-6912
DOI: 10.1007/s00493-013-2820-6